منابع مشابه
Vertically Iterated Classical Enrichment
Lyubashenko has described enriched 2–categories as categories enriched over V–Cat, the 2–category of categories enriched over a symmetric monoidal V. This construction is the strict analogue for V–functors in V–Cat of Brian Day’s probicategories for V–modules in V–Mod. Here I generalize the strict version to enriched n–categories for k–fold monoidal V. The latter is defined as by Balteanu, Fied...
متن کاملEnrichment over iterated monoidal categories
Joyal and Street note in their paper on braided monoidal categories [9] that the 2–category V –Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V . The exception that they mention is the case in which V is symmetric, which leads to V –Cat being symmetric as well. The symmetry in V –Cat is based upon the symmetry of...
متن کاملEnrichment as Categorical Delooping I: Enrichment Over Iterated Monoidal Categories
Joyal and Street note in their paper on braided monoidal categories [10] that the 2–category V–Cat of categories enriched over a braided monoidal category V is not itself braided in any way that is based upon the braiding of V. What is meant by “based upon” here will be made more clear in the present paper. The exception that they mention is the case in which V is symmetric, which leads to V–Ca...
متن کاملLoop Spaces and Iterated Higher Dimensional Enrichment
There is an ongoing massive effort by many researchers to link category theory and geometry, especially homotopy coherence and categorical coherence. This constitutes just a part of the broad undertaking known as categorification as described by Baez and Dolan. This effort has as a partial goal that of understanding the categories and functors that correspond to loop spaces and their associated...
متن کاملBounding Iterated Function Systems via Convex Optimization
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2018
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2018.11.015